منابع مشابه
A Fast and Efficient Processor Allocation Strategy which Combines a Contiguous and Non-contiguous Processor Allocation Algorithms
Two strategies are used for the allocation of jobs to processors connected by mesh topologies: contiguous allocation and non-contiguous allocation. In non-contiguous allocation, a job request can be split into smaller parts that are allocated possibly non-adjacent free sub-meshes rather than always waiting until a single submesh of the requested size and shape is available. Lifting the contigui...
متن کاملProcessor Allocation for Matrix
In this paper, we present the problem of allocating processors for matrix products. First, we consider how many processors should be allocated for computing one matrix product on a parallel system. Then, we discuss how to allocate processors for a number of independent matrix products on the parallel system. In many cases, it is shown that the performance of parallel algorithms does not improve...
متن کاملFaster high-quality processor allocation
We examine fast algorithms to allocate processors to compute jobs in mesh-connected clusters. We find that a 1D curve-based strategy can give allocations of comparable quality to a fully 3D algorithm MC1x1 using a snake curve that goes along the mesh’s short dimensions first. We also propose several buddy-system strategies, the best of which actually finds better allocations than MC1x1 if the j...
متن کاملProcessor Allocation for Parallel Execution
In this paper we explore an important issue, processor allocation, to improve the parallel execution of hash joins. To exploit the opportunity of pipelining for hash join execution, a scheme to transform a bushy execution tree to an allocation tree is rst devised. In an allocation tree, each node denotes a pipeline. Then, using the concept of synchronous execution time, processors are allocated...
متن کاملDistributed Processor Allocation in Multicomputers
Current processor allocation techniques for multicomputers are based on centralized front-end based algorithms. As a result, the applied strategies are usually restricted to static, contiguous, structure preserving allocation, and suffer from low parallelism and weak fault tolerance. To lift these restrictions we are investigating a distributed approach to the processor allocation problem for m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 1995
ISSN: 0196-6774
DOI: 10.1006/jagm.1995.1023